Display Sets of Normal and Tree-Child Networks

Phylogenetic trees canonically arise as embeddings of phylogenetic networks. We recently showed that the problem deciding if two networks embed same sets is computationally hard, \blue{in particular, we it to be $\Pi^P_2$-complete}. In this paper, establish a polynomial-time algorithm for decision initial consists normal network and tree-child network. The running time quadratic in size leaf sets.